Hypergraph Partitioning for Sparse Matrix-Matrix Multiplication
نویسندگان
چکیده
منابع مشابه
Hypergraph-Partitioning-Based Decomposition for Parallel Sparse-Matrix Vector Multiplication
ÐIn this work, we show that the standard graph-partitioning-based decomposition of sparse matrices does not reflect the actual communication volume requirement for parallel matrix-vector multiplication. We propose two computational hypergraph models which avoid this crucial deficiency of the graph model. The proposed models reduce the decomposition problem to the well-known hypergraph partition...
متن کاملRevisiting Hypergraph Models for Sparse Matrix Partitioning
We provide an exposition of hypergraph models for parallelizing sparse matrix-vector multiplies. Our aim is to emphasize the expressive power of hypergraph models. First, we set forth an elementary hypergraph model for parallel matrix-vector multiply based on one-dimensional (1D) matrix partitioning. In the elementary model, the vertices represent the data of a matrix-vector multiply, and the n...
متن کاملHypergraph-Partitioning-Based Sparse Matrix Ordering
Introduction In this work we propose novel sparse matrix ordering approaches based on hypergraph partitioning. The significance of hypergraph-partitioning-based (HP-based) ordering is three-fold. First, almost all of the successful nested dissection [6] tools [7, 9, 10] are based on multilevel graph partitioning tools [7, 8, 10] with some extra initial partitioning and refinement strategies spe...
متن کاملHypergraph Partitioning Based Models and Methods for Exploiting Cache Locality in Sparse Matrix-Vector Multiplication
Sparse matrix-vector multiplication (SpMxV) is a kernel operation widely used in iterative linear solvers. The same sparse matrix is multiplied by a dense vector repeatedly in these solvers. Matrices with irregular sparsity patterns make it difficult to utilize cache locality effectively in SpMxV computations. In this work, we investigate singleand multiple-SpMxV frameworks for exploiting cache...
متن کاملHypergraph Models for Sparse Matrix Partitioning and Reordering
HYPERGRAPH MODELS FOR SPARSE MATRIX PARTITIONING AND REORDERING Umit V. C ataly urek Ph.D. in Computer Engineering and Information Science Supervisor: Assoc. Prof. Cevdet Aykanat November, 1999 Graphs have been widely used to represent sparse matrices for various scienti c applications including one-dimensional (1D) decomposition of sparse matrices for parallel sparse-matrix vector multiplic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Parallel Computing
سال: 2016
ISSN: 2329-4949,2329-4957
DOI: 10.1145/3015144